Compiling relational Bayesian networks for exact inference
نویسندگان
چکیده
منابع مشابه
Compiling relational Bayesian networks for exact inference
We describe in this paper a system for exact inference with relational Bayesian networks as defined in the publicly available Primula tool. The system is based on compiling propositional instances of relational Bayesian networks into arithmetic circuits and then performing online inference by evaluating and differentiating these circuits in time linear in their size. We report on experimental r...
متن کاملParallelizing Exact Inference in Bayesian Networks
Exact inference is an approach for computing probabilities in Bayesian networks. Recently, this has been studied by various teams in the DARPA ACIP program. The popular Lauritzen Speigelhalter algorithm [2] converts a given Bayesian Network to a Junction Tree representation and then computes the exact inference on the same. The reason for this intermediate tree representation is that the common...
متن کاملModeling and Inference with Relational Dynamic Bayesian Networks
Many domains in the real world are richly structured, containing a diverse set of agents characterized by different set of features and related to each other in a variety of ways. Moreover, uncertainty both on the objects observations and on their relations can be present. This is the case of many problems as, for example, multi-target tracking, activity recognition, automatic surveillance and ...
متن کاملExact Sampling for Bayesian Inference : Unbounded
Propp and Wilson 10, 11] described a protocol called coupling from the past (CFTP) for exact sampling from the steady-state distribution of a Markov chain Monte Carlo (MCMC) process. In it a past time is identiied from which the paths of coupled Markov chains starting at every possible state would have coalesced into a single value by the present time; this value is then a sample from the stead...
متن کاملExact Inference on Conditional Linear Γ-Gaussian Bayesian Networks
Exact inference for Bayesian Networks is only possible for quite limited classes of networks. Examples of such classes are discrete networks, conditional linear Gaussian networks, networks using mixtures of truncated exponentials, and networks with densities expressed as truncated polynomials. This paper defines another class with exact inference, based on the normal inverse gamma conjugacy. We...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 2006
ISSN: 0888-613X
DOI: 10.1016/j.ijar.2005.10.001